On the Complexity of Semideenite Programs
نویسندگان
چکیده
We show that the feasibility of a system of m linear inequalities over the cone of symmetric positive semide nite matrices of order n can be tested in mnO(minfm;n2g) arithmetic operations with lnO(minfm;n2g)-bit numbers, where l is the maximum binary size of the input coe cients. We also show that any feasible system of dimension (m;n) has a solution X such that log kXk lnO(minfm;n2g).
منابع مشابه
Eecient Approximation Algorithms for Semideenite Programs Arising from Max Cut and Coloring Eecient Approximation Algorithms for Semideenite Programs Arising from Max Cut and Coloring
The best known approximation algorithm for graph MAX CUT, due to Goemans and Williamson, rst nds the optimal solution a semideenite program and then derives a graph cut from that solution. Building on this result, Karger, Motwani, and Sudan gave an approximation algorithm for graph coloring that also involves solving a semideenite program. Solving these semideenite programs using known methods ...
متن کاملEecient Approximation Algorithms for Semideenite Programs Arising from Max Cut and Coloring
The best known approximation algorithm for graph MAX CUT, due to Goemans and Williamson, rst nds the optimal solution of a semideenite program and then derives a graph cut from that solution. Building on this result, Karger, Motwani, and Su-dan gave an approximation algorithm for graph coloring that also involves solving a semideenite program. Solving these semideenite programs using known meth...
متن کاملSemideenite Programs and Combinatorial Optimization
Outline 1. Introductory examples: Shannon capacity and maximum cuts. 2. Preliminaries: linear programming, semideenite matrices. 3. General properties of semideenite programs: equivalent forms, Farkas Lemma, Duality Theorem, Ellipsoid method, Interior point method. 4. Getting semideenite programs I: eigenvalues of graphs and the method of variables. 5. Getting semideenite programs II: geometric...
متن کاملSemideenite Programs and Combinatorial Optimization
Outline 1. Introductory examples: Shannon capacity and maximum cuts. 2. Preliminaries: linear programming, semideenite matrices. 3. General properties of semideenite programs: equivalent forms, Farkas Lemma, Duality Theorem, Ellipsoid method, Interior point method. 4. Getting semideenite programs I: eigenvalues of graphs and the method of variables. 5. Getting semideenite programs II: geometric...
متن کاملApproximate Graph Coloring by Semide nite
We consider the problem of coloring k-colorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm which colors a 3-colorable graph on n vertices with minfO((1=3 log 4=3); O(n 1=4 log n)g colors where is the maximum degree of any vertex. Besides giving the best known approximation ratio in terms of n, this marks the rst non-trivial approximation result as ...
متن کاملApproximate Graph Coloring by Semideenite Programming
We consider the problem of coloring k-colorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm which colors a 3-colorable graph on n vertices with minfO((1=3 log 1=2 logn); O(n 1=4 log 1=2 n)g colors where is the maximum degree of any vertex. Besides giving the best known approximation ratio in terms of n, this marks the rst non-trivial approximation r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996